GATE PYQ

ISRO CSE 2008

Q1.
Which of the following is an illegal array definition?

Q2.
More than one word are put in one cache block to:

Q3.
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as

Q4.
With Round-Robin CPU scheduling in a time shared system

Q5.
The performance of Round Robin algorithm depends heavily on

Q6.
Feedback queues

Q7.
Four jobs to be executed on a single processor system arrive at time 0 in the order A,B,C,D. Their burst CPU time requirements are 4,1,8,1 time units respectively. The completion time of A under round robin scheduling with time slice of one time unit is

Q8.
Consider the following code segment: for (int k=0; k<20; k=k+2) { if (k % 3 == 1) system.out.print(k+ " "); } What is printed as a result of executing the code segment?

Q9.
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require?

Q10.
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?